Random Trees, Heights, and Large Deviations

نویسنده

  • Nicolas Broutin
چکیده

Random trees are of prime importance for studying the average case behavior of algorithms and data structures. The canonical examples are Hoare’s quicksort algorithm and the binary search tree. The most natural parameter to study is the average running time of the algorithm, and the average time for answering a query in a data structure. This does not provide sufficient information to properly dimension the systems, and one usually wants to quantify the extreme values that should occur (in an average sense). In the case of trees, one of the extreme values of interest is the height.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Shedding new light on random trees

We introduce a weighted model of random trees and analyze the asymptotic properties of their heights. Our framework encompasses most trees of logarithmic height that were introduced in the context of the analysis of algorithms or combinatorics. This allows us to state a sort of“master theorem”for the height of random trees, that covers binary search trees (Devroye, 1986), random recursive trees...

متن کامل

Statistics of delta peaks in the spectral density of large random trees

We present an analysis of the spectral density of the adjacency matrix of large random trees. We show that there is an infinity of delta peaks at all real numbers which are eigenvalues of finite trees. By exact enumerations and Monte-Carlo simulations, we have numerical estimations of the heights of peaks. In the large tree limit, the sum of their heights is 0.19173 ± 0.00005. Moreover all asso...

متن کامل

Large Deviations for the Leaves in Some Random Trees

Large deviation principles and related results are given for a class of Markov chains associated to the “leaves” in random recursive trees and preferential attachment random graphs, as well as the “cherries” in Yule trees. In particular, the method of proof, combining analytic and Dupuis-Ellis type path arguments, allows for an explicit computation of the large deviation pressure.

متن کامل

The height of increasing trees

We extend results about heights of random trees (Devroye, 1986, 1987, 1998b). In this paper, a general split tree model is considered in which the normalized subtree sizes of nodes converge in distribution. The height of these trees is shown to be in probability asymptotic to c logn for some constant c. We apply our results to obtain a law of large numbers for the height of all polynomial varie...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007